Section: New Software and Platforms

CFS

Functional Description: Reference implementation of parallel CFS (reinforced version of the digital signature scheme CFS). Two variants are proposed, one with a « bit-packing » finite field arithmetic and an evolution with a « bit-slicing » finite-field arithmetic (collaboration with Peter Schwabe). For 80 bits of security the running time for producing one signature with the « bit-packing » variant is slightly above one second. This is high but was still the fastest so far. The evolution with the « bit-slicing » arithmetic produces the same signature in about 100 milliseconds.

• Participants: Grégory Landais and Nicolas Sendrier

• Contact: Nicolas Sendrier

• URL: https://gforge.inria.fr/projects/cfs-signature/